Method and apparatus for sending data from multiple sources over a communications bus

ABSTRACT

In a memory system, multiple memory modules communicate over a bus. Each memory module includes a hub and at least one memory storage unit. The hub receives local data from the memory storage units, and downstream data from one or more other memory modules. The hub assembles data to be sent over the bus within a data block structure, which is divided into multiple lanes. An indication is made of where, within the data block structure, a breakpoint will occur in the data being placed on the bus by a first source (e.g., the local or downstream data). Based on the indication, data from a second source (e.g., the downstream or local data) is placed in the remainder of the data block, thus reducing gaps on the bus.

TECHNICAL FIELD

The invention relates generally to assembling and sending data on apacket-based communications bus, and more particularly, to assemblingdata from multiple sources to prepare them to be sent on a commoncommunications bus.

BACKGROUND

A typical computer system 100, such as that illustrated in FIG. 1,includes a processor 102, a memory controller 104, and main memorystorage 106. Main memory storage 106 includes one or more memory chips,such as Dynamic Random Access Memory (DRAM) chips.

In order for the processor 102 to obtain data from main memory storage106, the processor 102 sends a data request to the memory controller 104over a communications bus 108. Memory controller 104 processes andreformats the request, and sends one or more reformatted requestmessages to main memory storage 106 over a main memory storage bus 110.Main memory storage 106 then returns the requested data to memorycontroller 104 over the main memory storage bus 110. After receiving therequested data, memory controller 104 then sends the data to processor102 over the data communications bus 108.

The information and data associated with a particular request is oftenreferred to as a “transaction.” At times, memory controller 104 could beprocessing multiple transactions simultaneously. This can result in asituation where data from multiple sources (e.g., multiple DRAMs withinmain memory storage 106) are simultaneously available to be returnedfrom main memory storage 106 to the memory controller 104 over the mainmemory storage bus 110. When this occurs, memory controller 104 performsan arbitration process to determine which source (e.g., which DRAM) willbe granted access to the main memory storage bus 110.

Once access is granted, main memory storage 106 places the dataassociated with a transaction on the main memory storage bus 110 for oneor more bus clock cycles, depending on the size of the transaction andthe width of the main memory storage bus 110 (e.g., the number ofparallel bits). For example, if a transaction includes 52 data bits, andthe bus width is 32 bits, two clock cycles would be necessary totransfer the data on the bus 110. Assuming, for simplicity, that noheader information is included, the first 32 bits could be transferredduring a first clock cycle, and the last 20 bits could be transferredduring a second clock cycle.

The above example illustrates that, during the last clock cycle in whicha transaction's data is being transferred on the main memory storage bus110, the bus 110 often is not completely filled. In the present example,only 20 of the 32 available bits are filled during the second clockcycle, leaving 12 bits empty. In current systems, if the main memorystorage bus 110 will be granted to another source (e.g., another DRAM)upon the completion of the transaction, these 12 bits would be leftempty, and the data for the next transaction would start on the nextclock cycle.

The example illustrates that gaps inherently exist on the main memorystorage bus 110, using prior art techniques. These gaps result inincreased system latency and decreased bandwidth. Accordingly, what areneeded are methods and apparatuses that more efficiently assemble datafrom multiple sources for transmission on a bus.

SUMMARY

In one embodiment, an electronic system includes a processor, whichgenerates and sends one or more memory access requests, and multiplememory modules. The memory modules are operatively coupled togetherthrough a communications bus, and they return data requested in the oneor more memory access requests. Each of the multiple memory modules is adata source, and a memory module of the multiple memory modulesdetermines that first source data and second source data are available.It also allocates one or more first contiguous lanes within a firstsection of a data block to at least some of the first source data, wherethe data block includes a set of multiple lanes, and each lane includesa set of configurable bits, and allocates one or more second contiguouslanes within a second section of the data block to at least some of thesecond source data. The second section begins at a next lane, which iscontiguous with the first section. The memory module also sends, overthe communications bus and during a data block transmission period, atleast a portion of the first source data within the first section of thedata block, and at least a portion of the second source data within thesecond section of the data block.

In a further embodiment, a memory module includes one or more memorystorage units for storing local data, and a hub, operatively coupled tothe one or more memory storage units and to a communications bus overwhich the hub can receive downstream data from one or more other hubs.The hub determines that first source data and second source data areavailable. The hub also allocates one or more first contiguous laneswithin a first section of a data block to at least some of the firstsource data, where the data block includes a set of multiple lanes, andeach lane includes a set of configurable bits, and allocates one or moresecond contiguous lanes within a second section of the data block to atleast some of the second source data, where the second section begins ata next lane, which is contiguous with the first section. The hub alsosends, over the communications bus and during a data block transmissionperiod, at least a portion of the first source data within the firstsection of the data block, and at least a portion of the second sourcedata within the second section of the data block.

In a further embodiment, an apparatus for assembling and sending dataincludes means for receiving local data from one or more memory storageunits, means for receiving downstream data over a communications busfrom one or more downstream data sources, and means for making adetermination of how the local data and the downstream data will be sentover the communications bus. Making the determination includesallocating one or more first contiguous lanes within a first section ofa data block to at least some of the local data, where the data blockincludes a set of multiple lanes, and each lane includes a set ofconfigurable bits, and allocating one or more second contiguous laneswithin a second section of the data block to at least some of thedownstream data, where the first section and the second section arecontiguous.

In a further embodiment, an apparatus for sending data over acommunications bus includes means for receiving first source data from afirst data source, means for receiving second source data from a seconddata source, and means for sending the first source data and the secondsource data over the communications bus. Sending the first source dataand the second source data includes sending the first source data overthe communications bus, identifying a first breakpoint corresponding toan end of the first source data, sending the second source data over thecommunications bus contiguously with the end of the first source data,and identifying a second breakpoint corresponding to an end of thesecond source data.

In a further embodiment, a method for sending data on a communicationsbus includes arranging a first portion of first source data within adata block structure during a first processing period, where the datablock structure includes a fixed number of contiguous, configurablebits, and sending the first portion of the first source data over thecommunications bus. The method further includes arranging a remainderportion of the first source data within a first section of the datablock structure during a second processing period, where the firstsection includes a first set of contiguous bits, arranging a firstportion of second source data within a second section of the data blockstructure during the second processing period, where the second sectionis contiguous with the first section, and the second section includes asecond set of contiguous bits, and sending the remainder portion of thefirst source data and the first portion of the second source data.

In a further embodiment, a method includes determining that first sourcedata and second source data are available, and allocating one or morefirst contiguous lanes within a first section of a data block to atleast some of the first source data, where the data block includes a setof multiple lanes, and each lane includes a set of configurable bits.The method further includes allocating one or more second contiguouslanes within a second section of the data block to at least some of thesecond source data, where the second section begins at a next lane,which is contiguous with the first section, and sending, over acommunications bus and during a data block transmission period, at leasta portion of the first source data within the first section of the datablock, and at least a portion of the second source data within thesecond section of the data block.

In a further embodiment, a method includes arranging first source datafrom a first source within a first section of a data block structure,where the data block structure includes a fixed number of contiguous,configurable bits, and data within the data block structure isperiodically sent out on a communications bus. The method furtherincludes determining that second source data from a second source isavailable to be sent over the communications bus, and requesting accessto the communications bus to send the second source data. The methodfurther includes receiving an indication of where, within the data blockstructure, at least a portion of the second source data should beplaced, arranging at least a portion of the second source data withinthe data block structure according to the indication, resulting in atleast a portion of the second source data occupying a second section ofthe data block that is contiguous with an end of the first section, andsending the first source data and at least a portion of the secondsource data over the communications bus during a data block transmissionperiod.

In a further embodiment, a method includes arranging first source datawithin a first section of a data block structure, where the data blockstructure includes fixed number of contiguous, configurable bits. Themethod further includes receiving a request to send second source dataover the communications bus, identifying a location of a breakpoint inthe first source data, and arranging at least a portion of the secondsource data within a second section of the data block structure afterthe breakpoint, where the second section is contiguous with an end ofthe first section. The method further includes sending the first sourcedata and at least a portion of the second source data over thecommunications bus during a data block transmission period.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a simplified block diagram of a computer system, inaccordance with the prior art;

FIG. 2 illustrates a simplified block diagram of a computer system, inaccordance with an embodiment of the invention;

FIG. 3 illustrates a simplified block diagram of a memory module, inaccordance with an embodiment of the invention;

FIG. 4 illustrates a simplified block diagram of a hub, in accordancewith an embodiment of the invention;

FIG. 5 illustrates an example of a timing diagram, in accordance with anembodiment of the invention;

FIG. 6 illustrates a flowchart of a method for requesting access to thebus, in accordance with an embodiment of the invention;

FIG. 7 illustrates a flowchart of a method for granting access to thebus, in accordance with an embodiment of the invention; and

FIG. 8 illustrates an electronic system, in accordance with oneembodiment of the invention.

DESCRIPTION OF THE EMBODIMENTS

In the following description of the embodiments, reference is made tothe accompanying drawings, which form a part hereof and show, by way ofillustration, specific embodiments in which the invention may bepracticed. These embodiments are described in sufficient detail toenable those skilled in the art to practice the invention, and it is tobe understood that other embodiments may be utilized, and that processor mechanical changes may be made, without departing from the scope ofthe invention. It will be recognized that the methods of the variousembodiments can be combined in practice, either concurrently or insuccession. Various permutations and combinations will be readilyapparent to those skilled in the art.

The various embodiments of the invention, described in detail herein,involve new and novel methods and apparatuses for assembling and sendingdata. The embodiments of the invention have several significantadvantages over prior art methods. Specifically, the embodiments of theinvention provide decreased system latency and increased bandwidth, whenimplemented in a memory system in which data from multiple sources needto be returned to one or more requesters.

FIG. 2 illustrates a simplified block diagram of a computer system 200,in accordance with an embodiment of the invention. In one embodiment,system 200 includes one or more processors 202, a link controller 206,and one or more memory modules 208-211. For ease of description, only asingle processor 202 and link controller 206 are illustrated anddiscussed. However, multiple processors 202 and/or link controllers 206could exist within a system. Similarly, although four memory modules208-211 are illustrated, more or fewer memory modules also could existwithin a system.

In one embodiment, each memory module 208-211 is located on a separatesubstrate, such as an insertable printed circuit board. In otherembodiments, multiple memory modules could be located on a singlesubstrate, and/or portions of the memory modules could be distributedacross multiple substrates. A memory module, in accordance with anembodiment of the invention, will be described in more detail later inconjunction with FIG. 3.

From time to time, processor 202 generates and sends requests for accessto information stored within one or more of memory modules 208-211.These “memory access requests” include requests to store data withinmemory modules 208-211, as well as requests to retrieve data from memorymodules 208-211. Besides processor 202, one or more other requesters 204could be present within the system 200, in one embodiment. For example,the system 200 could include one or more other processors, interfaces,ports, adapters, or other entities which are capable of requesting data.Processor 202 and the one or more other requesters 204 are referred toherein as “request originators.”

Each access request is initially processed by link controller 206, whichreceives the access requests from the request originators 202, 204. Forexample, but not by way of limitation, link controller 206 could be aNorth Bridge or some other type of processing element. Based on thecontent of the request, link controller 206 generates and sends one ormore “memory access commands” to one or more of the memory modules208-211 over a communications bus 220, referred to herein as the “linkbus.” If a memory access request asks for data to be retrieved (asopposed to stored), the memory modules 208-211 return the requested datato the link controller 206 over the link bus 220, and the linkcontroller 206 routes the requested data back to the request originator202, 204.

In one embodiment, memory modules 208-211 are operatively coupledtogether via the link bus 220 in a “tunneled” or “daisy-chained”configuration. In this configuration, link controller 206 isinterconnected over the link bus with a first memory module 208.Accordingly, a first part 222 of the link bus 220 interconnects linkcontroller 206 and the first memory module 208. The first memory module208, in turn, is interconnected over the link bus with a second memorymodule 209. Thus, a second part 224 of the link bus 220 interconnectsfirst memory module 208 and a second memory module 209, and so on.

In one embodiment, the link bus 220 is a parallel bus. For example, butnot by way of limitation, the link bus 220 is 32-bits wide. In otherembodiments, the link bus 220 could be wider or narrower than 32 bits,or it could be a serial bus.

The terms “downstream” and “upstream” will be used throughout aremainder of this description. The bottom memory module 211 exists atthe furthest downstream end of the link bus 220, and the link controller206 exists at the furthest upstream end of the link bus 220.Accordingly, data and information that a memory module receives from thedirection of the last memory module 211 is considered to be receivedfrom a downstream direction. In contrast, data and information that amemory module receives from the direction of the link controller 206 isconsidered to be received from an upstream direction. Using similarterminology, memory module 211 is considered to be downstream frommemory module 210, and memory modules 210 and 211 are considered to bedownstream from memory module 209, and memory modules 209-211 areconsidered to be downstream from memory module 208.

Each memory module 208-210 (except for the lowest memory module 211)provides a tunneled connection to any downstream memory module. Whendesired, additional memory modules (not shown) could be added downstreamfrom memory module 211, or additional memory modules could be insertedat any other point in the tunnel (e.g., between or above one or moreexisting memory modules).

In one embodiment, each memory module 208-210 passes each received,memory access command to its next downstream memory module, regardlessof the command destination (e.g., the memory module to which the commandis addressed). In another embodiment, each memory module 208-210 passesa received, memory access command in the downstream direction only if itis not the destination of the command.

Any type of information received from a downstream direction is referredto herein as “downstream data,” which could include data retrieved frommemory, headers and other protocol information, and any other type ofinformation received from a downstream memory module. Similarly, theterm “upstream data” is used herein to mean any type of informationreceived from upstream direction, and could include memory accesscommands, data to be stored, headers and other protocol information. Theuse of the term “data” is not meant to be limited only to actual datathat is stored or retrieved. This term is also meant to include headers,other protocol information, commands, and other types of information.

FIG. 3 illustrates a simplified block diagram of a memory module 300, inaccordance with an embodiment of the invention. In one embodiment, eachmemory module 300 includes a hub 302 and one or more memory storageunits 304. A hub, in accordance with an embodiment of the invention,will be described in more detail later in conjunction with FIG. 4.

In one embodiment, hub 302 and memory storage units 304 are co-locatedon a single substrate (e.g., a printed circuit board), which isremovably connectable to the communications bus. In other embodiments,hub 302 and one or more of the memory storage units 304 could be locatedon separate substrates, and/or the substrates could be permanentlyconnectable to the bus. Either way, each hub 302 has a set of memorystorage units 304 associated with it, and which it may accessexclusively. Accordingly, each memory module 300 can be considered a“data source.”

Memory storage units 304 could be connected to hub 302 through a commonlink (as shown), through point-to-point connections, through a daisychain link, or in some other way. In one embodiment, each memory storageunit 304 is a distinct memory component, such as a dynamic random accessmemory (DRAM) device, for example. In other embodiments, memory storageunits 304 could include other types of memory devices (e.g., read onlymemory (e.g., ROM, PROM, EEPROM, etc.), flash memory or other memorytypes). Although four memory storage units 304 are illustrated in FIG.3, more or fewer units 304 could be included on any memory module 300.

Hub 302 includes one or more application-specific integrated circuits(ASICs), in one embodiment. In another embodiment, hub 302 includes oneor more general-purpose or specific-purpose processors. Hub 302communicates over the upstream link bus 310 to upstream memory modules208 (FIG. 2) or to link controller 206. In addition, if any downstreammemory modules exist, hub 302 communicates over the downstream link bus312 to downstream memory modules. Accordingly, hub 302 receives datafrom downstream memory modules on a first part of the bus (i.e., thedownstream link bus 312), and sends data toward the link controller 206on a second part of the bus (i.e., the upstream link bus 310).

In one embodiment, when hub 302 receives a memory access command on theupstream link bus 310, hub 302 retransmits the command on the downstreamlink bus 312, and stores information regarding the command in a commandqueue (see element 412, FIG. 4, described later). Hub 302 alsodetermines whether it is the destination of the command. If so, hub 302makes whatever accesses are necessary to the memory storage units 304associated with the memory module 300, and sends the requested data onthe upstream link bus 310. In addition, hub 302 receives data on thedownstream link bus 312 from downstream memory modules (not shown), andhub 302 retransmits that data on the upstream link bus 310.

As the previous paragraph indicates, hub 302 receives data from at leasttwo sources: a) data from the memory storage units 304; and b) data fromdownstream memory modules. Data retrieved by hub 302 from the memorystorage units 304 associated with the hub 302 are referred to herein as“local data.” In contrast, data received by hub 302 from one or moredownstream memory modules on the downstream link bus 312 are referred toherein as “downstream data.” Although the terms “local data” and“downstream data” might be construed to mean that only two data sourcesexist within the system, the terms are not meant to be so limiting. Datacould originate from one or multiple other sources (e.g., one ormultiple downstream memory modules or other sources).

An important function provided by hub 302 is to receive both the localdata and the downstream data, and to provide both to the upstream linkbus 310. In one embodiment, hub 302 receives the local data anddownstream data, and sends them on the upstream link bus 310 in a mannerthat efficiently uses the resources available on the upstream link bus310. Specifically, the data is merged and sent without causingsignificant data “gaps” on the bus, where a “gap” includes one or morebits sent over the link bus without valid data, even though validdownstream or local data is available to be returned. The way that thisis accomplished is described in detail, in conjunction with theembodiments illustrated in FIGS. 4-8.

FIG. 4 illustrates a simplified, functional block diagram of a hub 400,in accordance with an embodiment of the invention. In one embodiment,hub 400 includes various functional elements, which are illustrated asdistinct blocks in FIG. 4, for the purposes of illustration. In variousembodiments, the actual logic elements and hardware associated with eachfunctional element could be resident in a single ASIC, or could beresident in multiple ASICs and/or other discrete devices. Further,various aspects of the functional elements illustrated in FIG. 4 couldbe implemented in hardware, software or both.

Briefly, in one embodiment, hub 400 receives local data and downstreamdata, determines how the data from the two sources will be mergedtogether, and provides the merged data to the upstream link bus 452. Thefunctional components of hub 400 are briefly described in the nextparagraph, in accordance with one particular embodiment. Otherembodiments and additional details are included in the description thatfollows.

Hub 400 includes a local data buffer 410 and a downstream data buffer420, which are used as means to receive and store local data anddownstream data, respectively, if necessary. Hub 400 also includes localarbitration logic means 414, downstream arbitration logic means 422, andinter-source arbitration means 416, which operate cooperatively todetermine how the local data and downstream data will be sent on theupstream link bus 452. Hub 400 also includes means for arranging localoutput 430, means for arranging downstream output 432, and data assemblymeans 450, which function to arrange the local data and the downstreamdata into a data block structure, in accordance with the determinationsmade by the arbitration means 414, 416, 422. The data block structure isrepresented by buffers 440, 442. The data organized into the data blockstructure is sent on the upstream link bus 452 in a contiguous manner.In addition, hub 400 includes command queue 412, into which the hubstores information relating to received memory access commands.

The data block structure will now be described in more detail. The datablock structure (also referred to herein as a “data block”) includes afixed number of configurable bits, in one embodiment. For example, inone embodiment, a data block includes 256 bits. In alternateembodiments, more or fewer bits could be present within a data block.When data is to be sent on the upstream link bus 452, the bits of thedata block structure are appropriately configured (e.g., by filling themwith a “1” or “0”) with data, and the data is clocked out onto the busduring a data block transmission period (i.e., one or more link busclock cycles, described later).

In one embodiment, the data block is divided into an integer number ofcontiguous “lanes,” where each lane includes a set of configurable bits.For example, in one embodiment, the data block includes a set of 8lanes. The number of lanes within the data block structure is fixed, inone embodiment, and each lane includes the same number of bits. In otherembodiments, the number of lanes could vary, and/or the number of bitsper lane could differ from lane to lane. The lane structure isrepresented in FIG. 4 by buffers 440, 442. Each buffer 440, 442represents a data block with 8 lanes, labeled “0” through “7”. Inpractice, buffers 440, 442 could be separate buffers, or they could bethe same buffer. Buffers 440, 442 are represented separately in FIG. 4for ease of description.

Using the example of a 256-bit data block and 8 lanes per block, eachlane would include 32 bits. Accordingly, lane 0 could be designated asbits 0-31, lane 1 could be designated as bits 32-63, lane 2 could bedesignated as bits 64-95, and so on, with lane 7 being designated asbits 224-255. In alternate embodiments, more or fewer lanes could bepresent within a data block. For example, a data block could include asfew as two lanes. In other alternate embodiments, lane 0 could includethe most significant bits and lane 7 could include the least significantbits, or vice versa, or the bits allocated to each lane could beallocated in a non-sequential manner.

As will be explained in more detail later, the lane structure of thevarious embodiments enables the hub 400 to efficiently send data overthe upstream link bus 452, when data is available from both a local anddownstream source. The hub 400 performs several basic processes. First,the hub determines when data from first and second sources (e.g., thelocal and downstream sources, or vice versa) are received and available.Second, an arbitration process is performed to determine which data willbe granted access to the upstream link bus during any particular datablock transmission period. Third, a lane filling process is performed toidentify which lanes will be utilized by which data during a particulardata block transmission period. The lane filling process involvesallocating one or more first contiguous lanes within a first section ofa data block to at least some of the first source data, and allocatingone or more second contiguous lanes within a second section of the datablock to at least some of the second source data, where the secondsection begins at a next lane, which is contiguous with the firstsection. Finally, the portions of the first source data and the secondsource data are sent over the communications bus during the data blocktransmission period.

Referring again to FIG. 4, downstream data is received from thedownstream link bus 454. In one embodiment, the downstream data iseither placed into a downstream data buffer 420, or is routed to adownstream flythrough path 472. Similarly, local data is received frommemory storage unit(s) 402 (e.g., units 304, FIG. 3). In one embodiment,the local data is either placed into a local data buffer 410, or isrouted to a local flythrough path 470.

The downstream flythrough path 472 and the local flythrough path 470 areused, in one embodiment, when no downstream or local data remain unsentin the downstream data buffer 420 or local data buffer 410, and whendata from only one source is vying for the upstream bus 452. In thesesituations, the data from either source is simply granted the bus, inorder to expedite the return of the data to the requester. In otherembodiments, either or both flythrough paths 470, 472 could be excludedfrom the system, and the local and downstream data could be bufferedregardless of the state of buffers 410, 420.

In the interests of fully describing the lane-packing techniques of thevarious embodiments, the remainder of the description assumes thatmultiple sources are vying for the bus, and that local data anddownstream data are being temporarily stored in the local data buffer410 and/or the downstream data buffer 420, respectively, rather thanbeing routed through either flythrough path 470, 472. Accordingly, datafrom multiple sources are assumed to be available, in much of thedescription that follows, and the multiple sources are vying for accessto the upstream link bus 452.

When downstream data is being received from the downstream link bus 454,a downstream data strobe signal 408 is sent to the downstreamarbitration logic means 422. Assuming that the downstream data is beingplaced into the downstream data buffer 420, a downstream buffer statussignal 467 indicates that the downstream data buffer is not empty. Whenthe buffer is not empty, the downstream flythrough path 472 is not used.

Downstream arbitration logic means 422 includes means for generating abus access request. When the data strobe 408 and buffer status signal467 indicate that downstream data is available to be sent over theupstream link bus 452, the downstream arbitration logic means 422 sendsa downstream request signal 461 to the inter-source arbitration means416. The downstream request asks the inter-source arbitration means 416to allow the downstream arbitration logic means 422 to provide itsdownstream data on the upstream link bus 452.

Similarly, on the local data side, when local data is being receivedfrom memory storage unit(s) 402, a local data strobe signal 404 is sentto the local arbitration logic means 414. Assuming that the local datais being placed into the local data buffer 410, a local buffer statussignal 477 indicates that the local data buffer is not empty. When thebuffer is not empty, the local flythrough path 470 is not used.

Local arbitration logic means 414 includes means for generating a busaccess request. When the data strobe 404 and buffer status signal 477indicate that local data is available to be sent over the upstream linkbus 452, the local arbitration logic means 414 sends a local requestsignal 471 to the inter-source arbitration means 416. Similar to thedownstream side previously discussed, the local request asks theinter-source arbitration means 416 to allow the local arbitration logicmeans 414 to provide its local data on the upstream link bus 452.

Accordingly, in one embodiment, inter-source arbitration means 416receives requests 471, 461 to access the bus from both local arbitrationlogic means 414 and downstream arbitration logic means 422. Inter-sourcearbitration means 416 includes a means for making a determination of howthe local and downstream data will be sent over the bus. Accordingly,when multiple requests are pending, means 416 performs an arbitrationprocess, and grants access to the local or downstream data.

Neither the local or downstream arbitration logic means 414, 422 sendtheir data until they have been granted access to the bus. In addition,when the inter-source arbitration means 416 decides to switch a grantfrom one source to another, the inter-source arbitration means 416determines and indicates where the next source should start its data,within the lane structure. Inter-source arbitration means 416 usesvarious information from the downstream and local arbitration logicmeans 422, 414 to make this determination.

Specifically, in one embodiment, a source that is granted access to thebus predicts where a “breakpoint” in its data will occur, and informsthe inter-source arbitration means 416 of the predicted location of thebreakpoint. The inter-source arbitration means 416 then uses thatpredicted location to determine where, within the lane structure, thenext granted source may begin to insert its data.

An example will clarify this concept. The example refers also to FIG. 5,which illustrates an example of a timing diagram, in accordance with anembodiment of the invention. Initially, only the internal clock signal502 and the lane data signals 508-515 will be discussed. The othersignals shown in FIG. 5 will be discussed later.

Signal 502 represents an internal clock signal. The internal clocksignal is used to define a “processing period” within which each datablock is assembled. A processing period refers to a period of timewithin which a single data block is assembled. Although FIG. 5illustrates a processing period that is one internal clock cycle long, aprocessing period may be longer or shorter than one internal clockcycle.

In the given example, the data block includes 8 lanes, and valid data isavailable in those lanes as indicated by lane data signals 508-515.During a first processing period 540, data is inserted into the lanes508-515 of the data block structure. Once assembled, that data is madeavailable to the bus. During a next processing period 542, differentdata is inserted into the lanes 508-515 of the data block structure, andsubsequently made available to the bus.

Further, although the relationship between the various edges of theinternal clock (i.e., the rising and falling edges) and the data andother signals is illustrated in one particular way in FIG. 5, thisrelationship could be different, in other embodiments. For example, theclock signal could be inverted with respect to the other signals. Othermodifications could be contemplated as well.

In one embodiment, a particular memory access request is considered a“transaction,” and a transaction identifier is associated with therequest in order to identify data that is returned. A transaction can bevirtually any length. For example, a transaction could be as short as asingle bit, or a transaction could be millions of bits long. In oneembodiment, the data associated with a transaction is returned as a setof “data fragments,” with each fragment including a number of bits thatcorresponds to the width of a lane. For example, if a transactionincludes 256 bits, and each lane is 32 bits wide, then the transactioncould be divided into 8 data fragments. A header may be sent along withthe data for a transaction, in order to identify the data. A headercould be of any length. In the embodiment described below, a headerconsumes no more than one lane. In other embodiments, a header couldconsume more than one lane, or a protocol could be used for which aheader is not returned for each transaction.

In the example illustrated in FIG. 5, during processing period 540, thefirst data being transferred includes a header 550, located in lane “0”508, and a first portion of local data consisting of seven fragments oflocal data, which are shown in lanes “1-7” 509-515. The symbols includedin each data envelope are represented as follows: “L” indicates localdata; “R” indicates downstream (or remote) data; “T*” indicates thetransaction number; and “D*” indicates the data fragment number for thetransaction. Accordingly, the identifier “L_T0_D0” shown in lane “1” 509indicates that the data within lane “1” during processing period 540corresponds to the first fragment (D0) of local data (L), for the localtransaction identified by “0” (T0). Similarly, the identifier “R_T0_D7”shown in lane “1” 509 during processing period 544 indicates that thedata corresponds to the eighth fragment (D7) of downstream data (R), forthe downstream transaction identified by “0” (T0).

Because data from the local source exists in the lane structure duringthe first processing period 540, it is assumed that the inter-sourcearbitration means (416, FIG. 4) previously granted access to the bus tothe local source. In the illustrated example, the local source had eightdata fragments to send during the first grant. Because the header 550consumed lane “0” 508 during the first processing period 540, only sevenof the eight data fragments could be assembled during that firstprocessing period 540. The remainder portion of the local source data,consisting of the eighth fragment designated “L_T0_D7,” is shown to beplaced in lane “0” during the second processing period 542.

The end of the eighth fragment “L_T0_D7” represents a “breakpoint” inthe local source data. This breakpoint coincides with the beginning oflane “1” 509 of the second processing period 542. In one embodiment,data from the local or downstream source can be used to fill theremaining lanes “1-7” for the second processing period 542.

In the example, the inter-source arbitration means (416, FIG. 4),granted access next to the downstream source (R). Specifically, thedownstream source has a header, and 16 data fragments (D0 through D15)to send during its first transaction (T0). Because the breakpoint occursat the beginning of lane “1” 509 of the second processing period 542,the header can be placed there. The 16 data fragments follow, asindicated by the indicators “R_T0_D0,” in lane “2” 510 of the secondprocessing period 542, through “R_T0_D15,” in lane “1” 509 of the fourthprocessing period 546. Specifically, 6 of the 16 data fragments (R_T0_D0through R_T0_D5) are placed in lanes 2-7 of the second processing period542. Thus, during the second processing period 542, a remainder portionof data from a first source is placed in a first section of the datablock structure, and a portion of data from a second source is placed ina second section of the data block structure.

The third processing period 544 is consumed entirely by the R_T0transaction, and no breakpoint occurs during that period. The breakpointof the downstream transaction does not occur until the beginning of lane“2” 510 of the fourth processing period 546. After the downstreamtransaction's breakpoint, a header and the first 5 of 10 local datafragments for a second local transaction, designated “T1,” are assembledduring the fourth and fifth processing periods 546, 548.

As FIG. 5 indicates, data from multiple sources can be placed in thelanes to be sent out during a particular data block transmission period.This is particularly illustrated during processing periods 542 and 546.In one embodiment, if data from a first source (e.g., local data ordownstream data) will consume less than all of the lanes, then data froma second source (e.g., downstream data or local data) can be placed inthe remaining, unutilized lanes. Accordingly, both first source data andsecond source data can be sent on the upstream link bus during a singledata block transmission period. Said another way, first source data isplaced in a first section of a data block, and second source data isplaced in a second section of the data block, where the second sectionbegins at a next lane, which is contiguous with the first section. Thisability to place data from multiple sources within a same data block, asprovided by the embodiments of the invention, result in reduced latencyfor data return and increased utilization of the link bus bandwidth.

The operation of the embodiment illustrated in FIG. 4 will now bedescribed in more detail in conjunction with the example illustrated inFIG. 5. During the first processing period 540, local data associatedwith a first local transaction (“L_T0”) is indicated as being availableby the state of the local data signal 504. In addition, downstream dataassociated with a first downstream transaction (“R_T0”) is indicated asbeing available by the state of the downstream data signal 506.

Referring also to FIG. 4, the local data signal 504 corresponds to thedata stored in local data buffer 410, and the downstream data signal 506corresponds to the data stored in downstream data buffer 420. When localdata strobe 404 indicates that data is available from a local source,the local arbitration logic means 414 sends a bus access request 471 tothe inter-source arbitration means 416. Similarly, when downstream datastrobe 408 indicates that data is available from a downstream source,the downstream arbitration logic means 422 also sends a bus accessrequest 461 to the inter-source arbitration means 416.

Inter-source arbitration means 416 uses various criteria to determinewho will be granted the bus during any given processing period. Wheninter-source arbitration means 416 decides to grant the bus to aparticular source, it sends a bus grant signal to that source. Forexample, as FIG. 5 indicates, the local data 504 (L_T0) is first grantedthe bus. Accordingly, inter-source arbitration means 416 sends a busgrant signal 474 to local arbitration logic means 414. In oneembodiment, the bus grant signal 474 is sent during the processingperiod in which the data will actually be placed in the data block(e.g., processing period 540). In other embodiments, the signal 474could be sent during a previous processing period.

In addition, inter-source arbitration means 416 sends a positionindicator, described further below, that enables local arbitration logicmeans 414 to know in which lane the header or data should first beplaced. In one embodiment, inter-source arbitration means 416 sends thisindication in the form of a “next lane in” signal 475 to localarbitration logic means 414. In the example of FIG. 5, the “next lanein” for the first processing period 540 is lane “0” 508. Accordingly,lane “0” is the lane into which the local arbitration logic means 414causes the header for its transaction data to be placed. Localarbitration logic means 414 then arranges its data so that the remaininglanes of the first processing period 540 will be filled with datafragments for its first transaction.

In one embodiment, arrange local output means 430 receives a signal 476from local arbitration logic means 414, which indicates the next lanein. Arrange local output means 430 then retrieves the header, if one isto be assembled that processing period. In one embodiment, informationto be included in the header is retrieved from the command queue 412. Inaddition, means 430 retrieves the data, from the local data buffer 410.Arrange local output means 430 arranges the header and/or data into alocal pre-transmit data block 440, which has the data block/lanestructure. For example, if the next lane in is lane “0,” then arrangelocal output means 430 would place the header in lane “0” of the localpre-transmit data block 440, and would place the first seven datafragments (L_T0_D0 through L_T0_D6) in lanes “1” through “7.”

Once the grant is issued to local arbitration logic means 414, means 414predicts the breakpoint of its data. In other words, it determines atwhich processing period, and in which lane, its data for the transactionwill be completed. In one embodiment, this prediction is based onknowledge, by the local arbitration logic means 414, of the transactionsize, which was previously stored in the command queue 412. In oneembodiment, local arbitration logic means 414 predicts the breakpoint asthe end of the entire transaction. In another embodiment, return of thedata for a transaction could be performed in multiple parts (e.g., ifthe transaction exceeds a certain size), and the breakpoint could occursomewhere before the end of the data.

In one embodiment, if the local arbitration logic means 414 predictsthat a breakpoint will occur within the next upcoming processing period,then it makes an indication that the breakpoint will occur by sending alocal breakpoint indicator signal 472 to the inter-source arbitrationmeans. In addition, means 414 makes an indication of the location of theend of the data, within the data block structure. In one embodiment,this is done by sending an indicator 473 of where, in the lanestructure, the breakpoint will occur. These signals correspond tosignals 526 and 524, in FIG. 5, respectively. In the example of FIG. 5,the local data arbitration logic means 414 knows that its transactionsize includes 8 data fragments (D0-D7), and thus it determines that itwill only need to fill lane “0” 508 of the second processing period 542,in order to complete the transaction. Accordingly, local dataarbitration logic means 414 would determine that a breakpoint would beoccurring in the next processing period 542.

Using the local breakpoint signal 472 (FIG. 4), 526 (FIG. 5), local dataarbitration logic means 414 indicates to the inter-source arbitrationmeans 416 that a breakpoint will be occurring. In the illustratedembodiment, this indication is made by setting signal 472, 526 to a highstate. In alternate embodiments, a low setting could be used, or someother type of indication could be made. Because the local breakpointsignal 472, 526 is a binary indication (i.e., either there is anupcoming breakpoint or not), the signal can be represented with a singlebit or wire.

In addition, using the next local lane signal 473 (FIG. 4), 524 (FIG.5), local data arbitration logic means 414 indicates to the inter-sourcearbitration means 416 where the next breakpoint will occur within thelane structure. In one embodiment, this indication comes in the form ofan identification of which lane will first be available, in the nextprocessing period 542. As the example illustrates, the next local lanesignal 473, 524 could carry a “1,” indicating that lane “1” 509 will beavailable to another source, if the other source is granted bus access.In another embodiment, the next local lane signal 473, 524 couldindicate which lane would carry the last fragment of data for thecurrent transaction (e.g., “L_T0_D7,” in the current example). In suchan embodiment, the next local lane signal 473, 524 would carry a “0,”indicating that lane “0” 508 will carry the last fragment.

Because the next local lane signal 473, 524 indicates the identity of alane, the number of bits that could be used for the signal 473, 524 issufficient to make such an indication. In an embodiment that uses 8lanes, 3 bits of information or wires could be used for the signal 473,524.

In various alternate embodiments, inter-source arbitration means 416could receive other types of information that enable it to determinewhether a breakpoint will occur in the next processing period, and wherethat breakpoint will occur. Alternatively, inter-source arbitrationmeans 416 could make either or both of these determinations itself. Instill other embodiments, an arbitration means, 414, 416 or 422, coulddetermine and indicate where a breakpoint will occur, even if thebreakpoint will occur during a processing period that occurs after thenext processing period. Numerous alternate embodiments could becontemplated, and those embodiments are intended to fall within thescope of the present invention.

When inter-source arbitration means 416 determines (via signal 526) thata breakpoint will be occurring in the next processing period 542, means416 may decide to grant the bus to the same source (i.e., the localsource, in the current example) or to another source (i.e., thedownstream source, in the current example) during the next period 542.In the example of FIG. 5, inter-source arbitration unit 416 decides togrant the bus to the downstream data 506 (R_T0), which also had apending request from the first processing period 540. Accordingly,inter-source arbitration unit 416 sends a bus grant signal 464 todownstream arbitration logic means 422. In one embodiment, the signal464 is sent during the second processing period 542. In anotherembodiment, the signal 464 could be send earlier (e.g., during the firstprocessing period 540).

In addition, inter-source arbitration means 416 sends a positionindicator, which enables downstream arbitration logic means 422 to knowin which lane its header or data should first be placed. In oneembodiment, inter-source arbitration means 416 sends this indication inthe form of the next lane in signal 465 to downstream arbitration logicmeans 422. The next lane in signal 465 could include a “laneidentifier,” which is an integer number identifying the lane. Forexample, in the example where 8 lanes exist within the data blockstructure, the lane identifiers could be the integer numbers from 0 to7. In other embodiments, a bit number within the data structure (e.g., anumber from 0 to 255 for a 256 bit data structure) or some otherindication of the location of the breakpoint could be sent.

In one embodiment, the next lane in signal 465 corresponds to the nextlocal lane signal 524 sent by the previously granted source (e.g., thelocal source, in this case), during the previous processing period 540.As described previously, the next local lane signal 524 sent by thelocal arbitration logic means 414 during the previous processing periodwas a “1”, meaning that lane “1” 509 is the first lane available afterthe breakpoint of the local data.

In other embodiments, the next lane in signal 465 could be a value thatis based on the value of the next local lane signal 524, although it maynot be exactly the same. For example, but not by way of limitation, thenext local lane signal 524 may indicate the last lane that the localdata will consume, and the next lane in signal 465 could indicate thefirst lane that the downstream data should first occupy. In addition,the next local lane signals and next lane in signals could be indicatedin a manner other than with a lane identifier. For example, either orboth could indicate a bit position, within the data block, or could beindicated in some other manner.

In the example of FIG. 5, the “next lane in” for the second processingperiod 542 is lane “1” 509, as was indicated during processing period540. Accordingly, lane “1” is the lane into which the downstreamarbitration logic means 422 causes the header for its transaction datato be placed. Downstream arbitration logic means 422 then arranges itsdata so that the remaining lanes for the second processing period 542will be filled with data fragments for its first transaction.

Once the grant is issued to downstream arbitration logic means 422, itpredicts the breakpoint of its data. In one embodiment, this predictionis based on knowledge, by the downstream arbitration logic means 422, ofthe transaction size, which was previously stored in the command queue412. In the illustrated example, the transaction size is 16 datafragments. Accordingly, the breakpoint will not occur during the thirdprocessing period 544 (i.e., the next processing period). Instead, thepredicted breakpoint occurs in the fourth processing period 546.Further, the downstream data arbitration logic means 422 knows that itstransaction size includes 16 data fragments (D0-D15), and thus itdetermines that it will fill lane “0” and “1” of the fourth processingperiod 546, in order to complete the transaction.

Referring to processing period 542, the downstream arbitration logicmeans 422 causes the remaining contiguous lanes to be filled with itsheader and data fragments. However, because a breakpoint will not beoccurring during the next processing period 544, it does not indicate,during processing period 542, via the downstream breakpoint signal 462,530, that a breakpoint is upcoming. Instead, as is discussed below, thisindication is made during processing period 544.

During processing period 544, the downstream arbitration logic means 422causes the entire data block to be filled with its transaction data(D6-D13). Now, because a breakpoint will be occurring during the nextprocessing period 546, downstream arbitration logic means 422 indicates,via the downstream breakpoint signal 462, 530, that a breakpoint isupcoming. In addition, downstream arbitration logic means 422 indicates,via the next downstream lane signal 463, 528, the location of thebreakpoint. As the next downstream lane signal 528 of the example ofFIG. 5 indicates, the breakpoint will occur in lane “2” 510 during thefourth processing period 546.

When inter-source arbitration means 416 determines (via signal 530) thata breakpoint will be occurring in the next processing period 546, means416 may decide to grant the bus to the same source (i.e., the downstreamsource, in the current example) or to another source (i.e., the localsource, in the current example) during the next period 546. In theexample of FIG. 5, inter-source arbitration unit 416 decides to grantthe bus to the local data 506 (R_T1), which had a pending request fromthe second processing period 542. The process then continues to repeatitself.

As discussed above, local arbitration logic means 414 and downstreamarbitration logic means 422 arrange their data so that the lanes of thedata block, for any given processing period, are correctly filled witheither local or downstream data. In one embodiment, this is done asfollows, using the example of the second processing period 542 (FIG. 5).

Arrange downstream output means 432 receives a signal 466 from localarbitration logic means 414, which indicates the next lane in. Arrangedownstream output means 432 then retrieves the header, if one is to beassembled that processing period. In one embodiment, information to beincluded in the header is retrieved from the command queue 412. Inaddition, means 432 retrieves the data, from the downstream data buffer420. Arrange downstream output means 432 arranges the header and/or datainto a downstream pre-transmit data block 442, which has the datablock/lane structure. For example, if the next lane in is lane “1,” thenarrange downstream output means 432 would place the header in lane “1”of the downstream pre-transmit data block 442, and would place the firstsix data fragments (R_T0_D0 through R_T0_D5) in lanes “2” through “7.”

As discussed previously, lane “0” of the data block is allocated to theremainder of the data from the local source. Accordingly, arrange localoutput means 430 would place that remainder data in the localpre-transmit data block 440. Specifically, it would place the last datafragment (L_T0_D7) from the transaction into lane “0” of the localpre-transmit data block 440.

In order to multiplex the data within the pre-transmit data blocks 440,442, inter-source arbitration means 416 sends a “local/downstreamselect” signal 460 to data assembly means 450. Data assembly means 450includes a means for assembling the data and sending the data over theupstream link bus 452 during a data block transmission period.

In one embodiment, the local/downstream select signal 460 is a signalhaving a number of bits that corresponds to the number of lanes in thedata block structure. In the given example, the local/downstream selectsignal 460 is an eight bit signal, where each bit corresponds to a lane.If a bit is in a first state (e.g., 0) it may indicate to the dataassembly means 450 that it should retrieve data from the correspondinglane of the local pre-transmit data block 440, and if the bit is in asecond state (e.g., 1), it may indicate that the data should beretrieved from the corresponding lane of the downstream pre-transmitdata block 442, or vice versa.

For example, assume the most significant bit of the local/downstreamselect signal 460 corresponds to lane “0,” and the least significant bitof the signal corresponds to lane “7.” Assume also that a value of “0”indicates the local source, and a value of “1” indicates the downstreamsource. For the second processing period 542 (FIG. 5), thelocal/downstream select signal 460 would have a value of “0 1 1 1 1 1 11”. For the fourth processing period 546, the signal 460 would have avalue of “1 1 0 0 0 0 0 0”.

In other embodiments, which bit corresponds to which particular lanecould be different. In addition, a value of “1” could indicate the localsource and “0” could indicate the local source. In still other alternateembodiments, the data assembly means 450 could determine which source touse for which lane using information that is differently formatted. Instill other alternate embodiments, a separate local pre-transmit datablock 440 and downstream pre-transmit data block 442 might not be used.Instead, data from the local and downstream source could be placeddirectly into a single pre-transmit data block (not illustrated). Inthis embodiment, it may not be necessary to inform data assembly means450 of the configuration of the lanes (i.e., which source is grantedwhich lane). Instead, data assembly means 450 could simply provide thedata in the single pre-transmit data block to the upstream link bus 452.

In one embodiment, the internal clock signal 502 operates at a lowerfrequency than the link bus clock, and the link bus clock frequency isapproximately an integer multiple of the internal clock signal 502frequency. For example, but not by way of limitation, the internal clocksignal 502 could operate at a frequency in the Megahertz (MHz) range,while the link bus clock could operate at a frequency in the Gigahertz(GHz) range. The internal clock and/or the link bus clock could operateat higher or lower data frequencies, as well. In addition, the clockscould operate at approximately the same frequency, in other embodiments.

Each link bus clock cycle, data provided by data assembly means 450 canbe sent over the upstream link bus 452. In one embodiment, one datablock is sent out over the upstream link bus 452 during a single “datablock transmission period,” where a data block transmission period couldbe one or multiple link bus clock cycles long.

For example, and not by way of limitation, assume each data blockincludes 64 bits of data. If the link bus is 32 bits wide, then two linkbus clock cycles could be used to send one data block. In this example,the frequency of the link bus clock could be two times the frequency ofthe internal clock, assuming that a processing period (e.g., period 540)is one internal clock cycle long, which may not be the case. Forexample, if the internal clock is operating at 400 MHz, the link busclock could operate at about 800 MHz.

Using another example, if the data block is 256 bits wide, and the linkbus is 16 bits wide, then 16 link bus clock cycles could be used to sendone data block. Accordingly, a single data block transmission periodwould be 16 link bus clock cycles long. In this example, the frequencyof the link bus clock could be 16 times the frequency of the internalclock. For example, if the internal clock is operating at 400 MHz, thelink bus clock could operate at about 6.4 GHz.

The above examples assume that a number of bits corresponding to thewidth of the link bus is sent out each link bus clock cycle (e.g., on arising or falling clock edge). In alternate embodiments, multiple setsof bits could be sent out each clock cycle (e.g., on both the rising andfalling clock edges). In these alternate embodiments, the duration of adata block transmission period would be different from the examplesgiven above.

Some of the functions of the local, downstream, and inter-sourcearbitration logic means 414, 422, 416 could be performed in a mannerthat can be depicted easily in flowchart form. Therefore FIGS. 6 and 7are now described, in order to provide further understanding of thevarious embodiments.

FIG. 6 illustrates a flowchart of a method for requesting access to thebus, in accordance with an embodiment of the invention. In oneembodiment, all or portions of the method could be performed by localarbitration logic means 414 (FIG. 4) and/or downstream arbitration logicmeans 422 (FIG. 4). In other embodiments, other functional elementscould perform all or portions of the method. For purposes ofdescription, the terms “first source” and “second source” are used todescribe an entity requesting access to the upstream bus. These termsare not meant to specifically identify the local or downstreamarbitration logic means 414, 422.

The method begins, in block 602, by determining whether data from afirst source is available for transmission over the upstream link bus.In one embodiment, this determination can be made from the state of adata strobe signal (e.g., strobe 404, 408, FIG. 4). In anotherembodiment, the determination could be made from a buffer empty/notempty signal (e.g., signal 477, 467, FIG. 4). The determination could bemade in other ways, as well, in other embodiments. If no first sourcedata is available, the method waits.

If first source data is available, then the first source sends a busaccess request, in block 604. In one embodiment, the request is sent tothe inter-source arbitration means 416 (FIG. 4). The inter-sourcearbitration means 416 could receive requests from other sources as well,during a particular internal processing period. The inter-sourcearbitration means 416 is responsible for arbitrating the incoming busaccess requests, and granting access.

In one embodiment, the first source waits for a grant indication fromthe inter-source arbitration means 416, in block 606. In addition, whenaccess is granted, the first source looks for a next lane availableindicator from the inter-source arbitration means 416. The next laneavailable indicator tells the first source where it should begin toplace a header and/or data, within the data block being constructed fortransmission.

In block 608, the first source then arranges its data within the datablock, accordingly. In one embodiment, data is arranged within one ormore pre-transmission data blocks (e.g., blocks 440, 442, FIG. 4).During some processing periods, only one source places data within thedata block, while during other processing periods, at least two sourcesplace data within the data block.

A determination is made, in block 610, whether the first source'stransaction will be completed during the next processing period. If not,then the first source continues to arrange its data within the next datablock. Since the transaction will not complete during that processingperiod, then all lanes of the next data block will be consumed by thefirst source. The procedure then iterates.

When it is determined that the first source's transaction will becompleted during a next processing period, then in block 612, the firstsource indicates, to the inter-source arbitration unit 416 (FIG. 4),that a breakpoint will occur. In addition, the first source sends anindication of where the breakpoint will occur. For example, the firstsource could send the identity of the next lane available after the endof the transaction.

During the next processing period, the first source then arranges anyremaining data, in block 614, within one or more first contiguous laneswithin a first section of the next data block. If no data remains (e.g.,if the breakpoint occurred after the last lane of the previous period),then the first source does not place any data within the next datablock. The method then repeats.

If the inter-source arbitration unit 416 (FIG. 4) decides to grant thebus next to a second source, then data from the second source will beplaced within one or more second contiguous lanes within a secondsection of the data block, where the second section begins at a nextlane, which is contiguous with the first section. Once the data block iscompleted, the first source data and the second source data are sentover the bus during a data block transmission period (i.e., one or morelink bus clock cycles).

FIG. 7 illustrates a flowchart of a method for granting access to thebus, in accordance with an embodiment of the invention. In oneembodiment, all or portions of the method could be performed byinter-source arbitration logic means 416 (FIG. 4). In other embodiments,other functional elements could perform all or portions of the method.

The method begins, in block 702, when a bus access request is receivedfrom a first source. For example, a bus access request could be made bythe local arbitration logic means 414 (FIG. 4) or the downstreamarbitration logic means 422 (FIG. 4). At different times, theinter-source arbitration logic means 416 could have from zero to manybus access requests pending, meaning that the requesters had not yetbeen granted access to the bus.

A determination is made, in block 704, whether the bus is idle. In oneembodiment, the bus is considered idle when no other source is currentlytransmitting on the bus, and no other requests are pending. If the busis idle, then the inter-source arbitration means 416 may indicate, tothe first source, that it is granted access to the bus, in block 714. Inaddition, the inter-source arbitration means 416 may indicate where abreakpoint will occur (e.g., an identity of the next lane available), incase another source is completing transmission on the bus during thatprocessing period.

In block 718, the inter-source arbitration means 416 (FIG. 4) may thencontrol the assembly and transmission of the data within the data blockto be sent. In one embodiment, this is achieved by sending alocal/downstream select signal 460 (FIG. 4), to the functional element(e.g., data assembly means 450, FIG. 4) that is responsible formultiplexing and sending the data over the upstream link bus. The methodthen ends.

Referring back to block 704, if the bus is not idle (e.g., anothersource is transmitting on the bus, or other requests are pending), thena determination is made whether a breakpoint will occur during the nextprocessing period, in block 706. This determination is made, in oneembodiment, by observing a breakpoint signal (e.g., signals 472, 462,FIG. 4) provided by the source that is using the bus. If no breakpointis upcoming, the method waits.

If a source that is currently using the bus indicates that a breakpointwill occur on the next processing period, then the identity of thelocation of the breakpoint is determined, in block 708. In oneembodiment, the location of the breakpoint is determined by observing a“next lane out” signal (e.g., signals 473, 463, FIG. 4) provided by thesource that is using the bus.

In block 710, any pending requests are arbitrated, to determine who willbe granted access to use the bus next. The arbitration process can usevarious criteria in determining who will gain access to the bus.

A determination is made, in block 712, whether the first source may senddata over the bus next. If so, then blocks 714 and 718 are performed,which were described above in more detail. The method then ends.

If the first source is not granted access to the bus in block 712, thenthe inter-source arbitration means 416 may indicate, to another sourcethat has requested access to the bus, that it is granted access to thebus, in block 716. In addition, the inter-source arbitration means 416may indicate where the breakpoint will occur (e.g., an identity of thenext lane available). Block 718 is then performed, and the method ends.

The hub architecture is described as being implemented primarily inhardware, in embodiments described above. In other embodiments, one ormore elements of the hub architecture could be implemented in firmwareor software, as a series of instructions which, when executed by amicroprocessor or other computing device, perform the same function andproduce the same result as the embodiments described above. Accordingly,a set of computer-executable instructions for performing the functionsof the hub could be stored on a computer-readable medium (e.g., a harddisk, optical or magnetic disk, ROM, RAM, or virtually any othercomputer-readable medium).

In addition, the hub architecture could be included as a part of anelectronic system. FIG. 8 illustrates an electronic system, inaccordance with one embodiment of the invention. FIG. 8 and thefollowing discussion are intended to provide a brief, generaldescription of a suitable environment in which embodiments of theinvention may be implemented. Those skilled in the art will appreciatethat the invention may be practiced with other computer systemconfigurations, including hand-held devices, multi-processor systems,microprocessor-based or programmable consumer electronics, networkpersonal computers, minicomputers, mainframe computers, databasecomputers, and the like.

The system shown in FIG. 8 includes a general purpose computer 800,which includes one or more processing units 810, a North Bridge 812,system memory 814, and a system bus 820, which interconnects varioussystem components, and may be any of several types of bus structures.

The North Bridge 812 acts as an interface between the system bus 820 andthe processing unit 810 and system memory 814, in one embodiment.Accordingly, the North Bridge 812 operates as an input/output (I/O)controller and a memory controller. In one embodiment, the North Bridge812 may contain a link controller, in lieu of a memory controller. TheNorth Bridge 812 communicates with the processing unit 810 over aprocessor bus 816, and communicates with system memory 814 over a memorybus 818.

The system memory 814 is configured in accordance with an embodiment ofthe invention. Accordingly, system memory 814 includes one or morememory modules 824 (e.g., modules 208, FIG. 2). Further, system memory814 could include a link controller (e.g., controller 206, FIG. 2),and/or read only memory (ROM) 825, and/or random access memory (RAM)826, in various embodiments.

The computer 800 further can include a hard disk drive 827 for readingfrom and writing to a hard disk, not shown, a magnetic disk drive 828for reading from or writing to a removable magnetic disk 829, and anoptical disk drive 830 for reading from or writing to a removableoptical disk 831, such as a CD ROM or other optical media. The hard diskdrive 827, magnetic disk drive 828, and optical disk drive 830 can beconnected to the system bus 820 by a hard disk drive interface 832, amagnetic disk drive interface 833, and an optical drive interface 834,respectively.

A user may enter requests and information into the computer 800 throughinput devices, such as a keyboard 840, pointing device 842 or otherinput devices (not shown). These and other input devices may beconnected to processing units 810 through a serial port interface 846that is coupled to the system bus, or may be connected by otherinterfaces, such as a parallel port, game port or a universal serial bus(USB). A monitor 847 or other type of display device also may beconnected to the system bus 820 via an interface, such as a videoadapter 848. In addition to the monitor, the system may also includeother peripheral output devices (not shown), such as speakers andprinters.

The computer 800 may operate in a networked environment using logicalconnections to one or more remote computers, such as a remote computer849. Computer 800 and remote computer 849 may be clients, servers,routers, network personal computers, peer devices or other commonnetwork nodes. The logical connections depicted in FIG. 8 include alocal area network (LAN) 851 and a wide area network (WAN) 852.

When used in a LAN networking environment, the computer 800 is connectedto the local network 851 through a network interface or adapter 853.When used in a WAN networking environment, the computer 800 typicallyincludes a modem 854 or other means for establishing communications overthe WAN 852. The modem 854, which may be internal or external, isconnected to the system bus 820 via the serial port interface 846. Itwill be appreciated that the network connections shown are exemplary andother means of establishing a communications link between the computersmay be used.

Conclusion

Various embodiments of a method and apparatus for assembling and senddata packets have been described, along with a description of theincorporation of the embodiments within an electronic system.Modifications that would be apparent to those of skill in the art couldbe made to the various embodiments to achieve the same results. Inparticular, but not by way of limitation, the arrangements andinterconnections between various, illustrated functional blocks andmethod steps could be different, and other and different functionalblocks and steps could be used to achieve the same function, insubstantially the same way, to achieve substantially the same result.Further, the type of system within which the embodiments areincorporated could be different (e.g., it could include more, fewer ordifferent components than those illustrated and described, or thecomponents could be interconnected in different ways). Further, some orall of the functional components could be implemented in software.

Although specific embodiments have been illustrated and describedherein, it will be appreciated by those of ordinary skill in the artthat any arrangement that is calculated to achieve the same purpose maybe substituted for the specific embodiments shown. Many adaptations ofthe invention will be apparent to those of ordinary skill in the art.Accordingly, this application is intended to cover any adaptations orvariations of the invention. It is manifestly intended that thisinvention be limited only by the following claims and equivalentsthereof.

1. An electronic system comprising: a processor, which generates andsends one or more memory access requests; and multiple memory modules,operatively coupled together through a communications bus, which returndata requested in the one or more memory access requests, wherein eachof the multiple memory modules is a data source, and a memory module ofthe multiple memory modules is operable for performing the following:determining that first source data and second source data are available;allocating one or more first contiguous lanes within a first section ofa data block to at least some of the first source data, wherein the datablock comprises a set of multiple lanes, and each lane includes a set ofconfigurable bits; allocating one or more second contiguous lanes withina second section of the data block to at least some of the second sourcedata, wherein the second section begins at a next lane, which iscontiguous with the first section; and sending, over the communicationsbus and during a data block transmission period, the at least a portionof the first source data within the first section of the data block, andthe at least a portion of the second source data within the secondsection of the data block.
 2. The electronic system of claim 1, furthercomprising: a link controller, operatively coupled between the processorand at least one of the multiple memory modules, which is operable forreceiving the one or more memory access requests, and generating andsending one or more memory access commands, based on the one or morememory access requests, to the multiple memory modules over thecommunications bus.
 3. The electronic system of claim 2, furthercomprising: the communications bus; wherein the memory module is furtheroperable for: receiving data from one or more other memory modules froma downstream direction on a first part of the communications bus; andsending the at least a portion of the first source data and the at leasta portion of the second source data toward the link controller on asecond part of the communications bus.
 4. The electronic system of claim1, wherein the memory module comprises: a first circuit, which isoperable for receiving downstream data from a second memory module overthe communications bus, wherein the downstream data is the first sourcedata; a second circuit, which is operable for receiving local data fromone or more memory storage units accessible to the memory module,wherein the local data is the second source data; and a third circuit,which is operable for assembling the downstream data and the local datainto the data block.
 5. The electronic system of claim 1, wherein thememory module comprises: a first circuit, which is operable forreceiving downstream data from a second memory module over thecommunications bus, wherein the downstream data is the second sourcedata; a second circuit, which is operable for receiving local data fromone or more memory storage units accessible to the memory module,wherein the local data is the first source data; and a third circuit,which is operable for assembling the downstream data and the local datainto the data block.
 6. The electronic system of claim 1, wherein theelectronic system is a computer.
 7. A memory module comprising: one ormore memory storage units for storing local data; and a hub, operativelycoupled to the one or more memory storage units and to a communicationsbus over which the hub can receive downstream data from one or moreother hubs, wherein the hub is operable for performing the following:determining that first source data and second source data are available,allocating one or more first contiguous lanes within a first section ofa data block to at least some of the first source data, wherein the datablock comprises a set of multiple lanes, and each lane includes a set ofconfigurable bits: allocating one or more second contiguous lanes withina second section of the data block to at least some of the second sourcedata, wherein the second section begins at a next lane, which iscontiguous with the first section; and sending, over the communicationsbus and during a data block transmission period, the at least a portionof the first source data within the first section of the data block, andthe at least a portion of the second source data within the secondsection of the data block.
 8. The memory module of claim 7, wherein theone or more memory storage units and the hub are co-located on a singlesubstrate that is removably connectable to the communications bus. 9.The memory module of claim 7, wherein the one or more memory storageunits includes one or more random access memory components.
 10. Thememory module of claim 9, wherein the one or more random access memorycomponents includes one or more dynamic random access memory components.11. The memory module of claim 7, wherein the one or more memory storageunits includes one or more read only memory components.
 12. The memorymodule of claim 7, wherein the hub includes one or more applicationspecific integrated circuits.
 13. The memory module of claim 7, whereinthe hub comprises: a first circuit, which is operable for receiving thedownstream data from a second hub over the communications bus, whereinthe downstream data is the first source data; a second circuit, which isoperable for receiving the local data from the one or more memorystorage units, wherein the local data is the second source data; and athird circuit, which is operable for assembling the downstream data andthe local data into the data block.
 14. The memory module of claim 7,wherein the hub comprises: a first circuit, which is operable forreceiving the downstream data from a second hub over the communicationsbus, wherein the downstream data is the second source data; a firstcircuit, which is operable for receiving the local data from the one ormore memory storage units, wherein the local data is the first sourcedata; and a first circuit, which is operable for assembling thedownstream data and the local data into the data block.
 15. An apparatusfor assembling and sending data comprising: means for receiving localdata from one or more memory storage units; means for receivingdownstream data over a communications bus from one or more downstreamdata sources; and means for making a determination of how the local dataand the downstream data will be sent over the communications bus,wherein making the determination includes: allocating one or more firstcontiguous lanes within a first section of a data block to at least someof the local data, wherein the data block comprises a set of multiplelanes, and each lane includes a set of configurable bits, and bits: andallocating one or more second contiguous lanes within a second sectionof the data block to at least some of the downstream data, wherein thefirst section and the second section are contiguous.
 16. The apparatusof claim 15, further comprising: means for generating a first accessrequest to send the local data over the communications bus; means forgenerating a second access request to send the downstream data over thecommunications bus; and wherein the means for making the determinationreceives the first access request and the second access request, andbases the determination on the first access request and the secondaccess request.
 17. The apparatus of claim 15, further comprising: meansfor arranging the local data and the downstream data into the datablock, according to the determination; and means for sending the datawithin the data block over the communications bus during a data blocktransmission period.
 18. An apparatus for sending data over acommunications bus, the apparatus comprising: a first circuit, which isoperable for receiving first source data from a first data source; asecond circuit, which is operable for receiving second source data froma second data source; and a third circuit, which is operable for sendingthe first source data and the second source data over the communicationsbus, wherein sending the first source data and the second source dataincludes: sending the first source data over the communications bus,identifying a first breakpoint corresponding to an end of the firstsource data; sending the second source data over the communications buscontiguously with the end of the first source data; and identifying asecond breakpoint corresponding to an end of the second source data. 19.The apparatus of claim 18, wherein the first circuit includes a fourthcircuit, which is operable for receiving downstream data from thecommunications bus, and the second circuit includes a fifth circuit,which is operable for receiving local data from one or more local memorystorage units.
 20. The apparatus of claim 18, wherein sending the firstsource data over the communications bus includes: arranging a firstportion of the first source data within a data block structure during afirst processing period, wherein the data block structure includes afixed number of contiguous, configurable bits; and arranging a remainderportion of the first source data within a first section of the datablock structure during a second processing period, wherein the firstsection includes a first set of contiguous bits.
 21. The apparatus ofclaim 20, wherein identifying the first breakpoint includes: identifyingthe first breakpoint as an end of the first section of the data blockstructure during the second processing period.
 22. The apparatus ofclaim 21, wherein sending the second source data over the communicationsbus includes: arranging a first portion of the second source data withina second section of the data block structure during the secondprocessing period, wherein the second section is contiguous with thefirst section, and the second section includes a second set ofcontiguous bits.
 23. The method of claim 22, wherein the data blockstructure includes a fixed number of lanes, each lane includes a samenumber of bits, the first section of the data block structure includes afirst set of the fixed number of lanes, and the second section of thedata block structure includes a second set of the fixed number of lanes.24. A method for sending data on a communications bus, the methodcomprising: arranging a first portion of first source data within a datablock structure during a first processing period, wherein the data blockstructure includes a fixed number of contiguous, configurable bits;sending the first portion of the first source data over thecommunications bus; arranging a remainder portion of the first sourcedata within a first section of the data block structure during a secondprocessing period, wherein the first section includes a first set ofcontiguous bits; arranging a first portion of second source data withina second section of the data block structure during the secondprocessing period, wherein the second section is contiguous with thefirst section, and the second section includes a second set ofcontiguous bits; and sending the remainder portion of the first sourcedata and the first portion of the second source data over thecommunications bus.
 25. The method of claim 24, further comprising:making an indication, during the first processing period, that abreakpoint in the first source data will occur during the secondprocessing period.
 26. The method of claim 24, further comprising:making an indication, during the first processing period, of a locationof an end of the first section.
 27. The method of claim 24, wherein thedata block structure includes a fixed number of lanes, each laneincludes a same number of bits, the first section of the data blockstructure includes a first set of the fixed number of lanes, and thesecond section of the data block structure includes a second set of thefixed number of lanes.
 28. The method of claim 27, further comprising:making an indication, during the first processing period, of a laneidentifier that corresponds with a last lane of the first section. 29.The method of claim 27, further comprising: making an indication, duringthe first processing period, of a lane identifier that corresponds witha first lane of the second section.
 30. A computer-readable mediumhaving computer-executable instructions for performing a methodcomprising: arranging a first portion of first source data within a datablock structure during a first processing period, wherein the data blockstructure includes a fixed number of contiguous, configurable bits:sending the first portion of the first source data over thecommunications bus: arranging a remainder portion of the first sourcedata within a first section of the data block structure during a secondprocessing period, wherein the first section includes a first set ofcontiguous bits: arranging a first portion of second source data withina second section of the data block structure during the secondprocessing period, wherein the second section is contiguous with thefirst section, and the second section includes a second set ofcontiguous bits: and sending the remainder portion of the first sourcedata and the first portion of the second source data over thecommunications bus.
 31. A method comprising: determining that firstsource data and second source data are available; allocating one or morefirst contiguous lanes within a first section of a data block to atleast some of the first source data, wherein the data block comprises aset of multiple lanes, and each lane includes a set of configurablebits; allocating one or more second contiguous lanes within a secondsection of the data block to at least some of the second source data,wherein the second section begins at a next lane, which is contiguouswith the first section; and sending, over a communications bus andduring a data block transmission period, the at least a portion of thefirst source data within the first section of the data block, and the atleast a portion of the second source data within the second section ofthe data block.
 32. The method of claim 31, wherein determining that thefirst source data and the second source data are available comprises:receiving a first indicator that the first source data is available froma first data source; and receiving a second indicator that the secondsource data is available from a second data source.
 33. The method ofclaim 31, wherein determining that the first source data and the secondsource data are available comprises: receiving a first request to sendthe first source data over the communications bus; and receiving asecond request to send the second source data over the communicationsbus.
 34. The method of claim 31, wherein allocating the one or moresecond contiguous lanes comprises: receiving information that enables anidentification of which lane is the next, contiguous lane; andallocating a number of lanes to the at least some of the second sourcedata, wherein a first lane of the number of lanes is the next,contiguous lane.
 35. A computer-readable medium havingcomputer-executable instructions for performing a method comprising:determining that first source data and second source data are available,allocating one or more first contiguous lanes within a first section ofa data block to at least some of the first source data, wherein the datablock comprises a set of multiple lanes, and each lane includes a set ofconfigurable bits, allocating one or more second contiguous lanes withina second section of the data block to at least some of the second sourcedata, wherein the second section begins at a next lane, which iscontiguous with the first section, and sending, over a communicationsbus and during a data block transmission period, the at least a portionof the first source data within the first section of the data block, andthe at least a portion of the second source data within the secondsection of the data block.
 36. A method comprising: arranging firstsource data from a first source within a first section of a data blockstructure, wherein the data block structure includes a fixed number ofcontiguous, configurable bits, and data within the data block structureis periodically sent out on a communications bus; determining thatsecond source data from a second source is available to be sent over thecommunications bus; requesting access to the communications bus to sendthe second source data; receiving an indication of where, within thedata block structure, at least a portion of the second source datashould be placed; arranging the at least a portion of the second sourcedata within the data block structure according to the indication,resulting in the at least a portion of the second source data occupyinga second section of the data block that is contiguous with an end of thefirst section; and sending the first source data and the at least aportion of the second source data over the communications bus during adata block transmission period.
 37. The method of claim 36, wherein thedata block structure includes a fixed number of lanes, each laneincludes a same number of bits, the first section of the data blockstructure includes a first set of the fixed number of lanes, and thesecond section of the data block structure includes a second set of thefixed number of lanes.
 38. The method of claim 37, wherein receiving theindication comprises receiving a lane identifier that corresponds with alast lane of the first section.
 39. The method of claim 37, whereinreceiving the indication comprises receiving a lane identifier thatcorresponds with a first lane of the second section.
 40. The method ofclaim 37, further comprising: predicting where a breakpoint will occurin the second source data.
 41. A computer-readable medium havingcomputer-executable instructions for performing a method comprising:arranging first source data from a first source within a first sectionof a data block structure, wherein the data block structure includes afixed number of contiguous, configurable bits, and data within the datablock structure is periodically sent out on a communications bus,determining that second source data from a second source is available tobe sent over the communications bus, requesting access to thecommunications bus to send the second source data; receiving anindication of where, within the data block structure, at least a portionof the second source data should be placed; arranging the at least aportion of the second source data within the data block structureaccording to the indication, resulting in the at least a portion of thesecond source data occupying a second section of the data block that iscontiguous with an end of the first section; and sending the firstsource data and the at least a portion of the second source data overthe communications bus during a data block transmission period.
 42. Amethod comprising: arranging first source data within a first section ofa data block structure, wherein the data block structure includes fixednumber of contiguous, configurable bits; receiving a request to sendsecond source data over the communications bus; identifying a locationof a breakpoint in the first source data; arranging at least a portionof the second source data within a second section of the data blockstructure after the breakpoint, wherein the second section is contiguouswith an end of the first section; and sending the first source data andthe at least a portion of the second source data over the communicationsbus during a data block transmission period.
 43. The method of claim 42,wherein the data block structure includes a fixed number of lanes, eachlane includes a same number of bits, the first section of the data blockstructure includes a first set of the fixed number of lanes, and thesecond section of the data block structure includes a second set of thefixed number of lanes.
 44. The method of claim 43, wherein identifyingthe location comprises identifying a lane that corresponds with a lastlane of the first section.
 45. The method of claim 43, whereinidentifying the location comprises identifying a lane that correspondswith a first lane of the second section.
 46. A computer-readable mediumhaving computer-executable instructions for performing a methodcomprising: arranging first source data within a first section of a datablock structure, wherein the data block structure includes fixed numberof contiguous, configurable bits. receiving a request to send secondsource data over the communications bus; identifying a location of abreakpoint in the first source data; arranging at least a portion of thesecond source data within a second section of the data block structureafter the breakpoint, wherein the second section is contiguous with anend of the first section; and sending the first source data and the atleast a portion of the second source data over the communications busduring a data block transmission period.